A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine
نویسندگان
چکیده
منابع مشابه
A Proof for P =? NP Problem
The P =? NP problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for P =? NP problem. The central idea of this proof is a recursive definition for Turing machine (shortly TM) that accepts the encoding strings of valid TMs. By the definition, an infinite sequence of TM i...
متن کاملThe P vs. NP problem
The resounding success of computers has often led to some common misconceptions about “computer science” — namely that it is simply a technological endeavor driven by a search for better physical material and devices that can be used to build smaller, faster, computers. Without trivializing this important quest, this article would like to highlight the complementary science behind computing: na...
متن کاملOn the P vs NP question: a proof of inequality
The analysis discussed in this paper is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem is derived, which is described by a Boolean function called “core function”. In this paper it is proved that the cost of the minimal implementation of core function increases with n exponentially. Since the synthesis of core functi...
متن کاملTuring Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملTape-Reversal Bounded Turing Machine Computations
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are investigated. The most striking difference between this and the previously studied complexity measures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2020
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v12n4p1